0.09/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.13	% Command    : run_portfolio.sh /export/starexec/sandbox2/benchmark/theBenchmark.p /export/starexec/sandbox2/tmp/tmp.ImTUhvGMtx
0.12/0.33	% Computer   : n018.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% DateTime   : Tue Jul 13 13:55:23 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.33	% Running portfolio for 120 s
0.12/0.33	% File         : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.12/0.33	% Number of cores: 8
0.12/0.34	% Python version: Python 3.6.8
0.12/0.34	% Running in HO mode
0.49/0.59	% Estimated wc time : 1286
0.49/0.59	% Estimated cpu time (7 cpus) : 183.71428571428572
0.49/0.70	% /export/starexec/sandbox2/solver/bin/lams/new_b3.2.norw.sh running for 15s
0.49/0.70	% /export/starexec/sandbox2/solver/bin/lams/b.rpo.sh running for 21s
0.49/0.71	% /export/starexec/sandbox2/solver/bin/lams/s6.sh running for 21s
0.49/0.71	% /export/starexec/sandbox2/solver/bin/lams/s6.ds.sh running for 10s
0.49/0.71	% /export/starexec/sandbox2/solver/bin/lams/c.s.2.sh running for 68s
0.49/0.71	% /export/starexec/sandbox2/solver/bin/lams/c.easy.sh running for 26s
0.49/0.72	% /export/starexec/sandbox2/solver/bin/lams/old_b3.avatar.sh running for 15s
9.72/1.96	% Solved by lams/old_b3.avatar.sh.
9.72/1.96	% done 132 iterations in 1.194s
9.72/1.96	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
9.72/1.96	% SZS output start Refutation
9.72/1.96	tff(def_n_pl, axiom, n_pl() = ^[X0]: ap(plus(X0))).
9.72/1.96	tff('0', plain, n_pl = (^[X0]: ap(plus(X0))),
9.72/1.96	    inference('simplify_rw_rule', [status(thm)], [def_n_pl])).
9.72/1.96	tff('1', plain, n_pl = (^[V_1]: ap(plus(V_1))), define([status(thm)])).
9.72/1.96	tff(def_n_1, axiom, n_1() = ordsucc(emptyset)).
9.72/1.96	tff(def_ordsucc, axiom, ordsucc() = ^[X0]: binunion(X0,d_Sing(X0))).
9.72/1.96	tff('2', plain, ordsucc = (^[X0]: binunion(X0,d_Sing(X0))),
9.72/1.96	    inference('simplify_rw_rule', [status(thm)], [def_ordsucc])).
9.72/1.96	tff('3', plain, ordsucc = (^[V_1]: binunion(V_1,d_Sing(V_1))),
9.72/1.96	    define([status(thm)])).
9.72/1.96	tff('4', plain, n_1 = ordsucc(emptyset),
9.72/1.96	    inference('simplify_rw_rule', [status(thm)], [def_n_1, '3'])).
9.72/1.96	tff('5', plain, n_1 = ordsucc(emptyset), define([status(thm)])).
9.72/1.96	tff(def_n_is, axiom, n_is() = e_is(nat)).
9.72/1.96	tff(def_nat, axiom, nat() = d_Sep(omega,^[X0]: (X0 != emptyset))).
9.72/1.96	tff('6', plain, nat = d_Sep(omega,^[X0]: (X0 != emptyset)),
9.72/1.96	    inference('simplify_rw_rule', [status(thm)], [def_nat])).
9.72/1.96	tff('7', plain, nat = d_Sep(omega,^[V_1]: (V_1 != emptyset)),
9.72/1.96	    define([status(thm)])).
9.72/1.96	tff(def_e_is, axiom, e_is() = ^[X0,X,Y]: (X = Y)).
9.72/1.96	tff('8', plain, e_is = (^[X0,X,Y]: (X = Y)),
9.72/1.96	    inference('simplify_rw_rule', [status(thm)], [def_e_is])).
9.72/1.96	tff('9', plain, e_is = (^[V_1,V_2,V_3]: (V_2 = V_3)), define([status(thm)])).
9.72/1.96	tff('10', plain, n_is = e_is(nat),
9.72/1.96	    inference('simplify_rw_rule', [status(thm)], [def_n_is, '7', '9'])).
9.72/1.96	tff('11', plain, n_is = e_is(nat), define([status(thm)])).
9.72/1.96	tff(def_all_of, axiom, all_of() =
9.72/1.96	  ^[X0:(($i > $o)),X1:(($i > $o))]: (![X2]: (is_of(X2,X0) => X1(X2)))).
9.72/1.96	tff(def_is_of, axiom, is_of() = ^[X0,X1:(($i > $o))]: X1(X0)).
9.72/1.96	tff('12', plain, is_of = (^[X0,X1:(($i > $o))]: X1(X0)),
9.72/1.96	    inference('simplify_rw_rule', [status(thm)], [def_is_of])).
9.72/1.96	tff('13', plain, is_of = (^[V_1,V_2:(($i > $o))]: V_2(V_1)),
9.72/1.96	    define([status(thm)])).
9.72/1.96	tff('14', plain,
9.72/1.96	    all_of =
9.72/1.96	    (^[X0:(($i > $o)),X1:(($i > $o))]: (![X2]: (is_of(X2,X0) => X1(X2)))),
9.72/1.96	    inference('simplify_rw_rule', [status(thm)], [def_all_of, '13'])).
9.72/1.96	tff('15', plain,
9.72/1.96	    all_of =
9.72/1.96	    (^[V_1:(($i > $o)),V_2:(($i > $o))]: (![X4]: (is_of(X4,V_1) => V_2(X4)))),
9.72/1.96	    define([status(thm)])).
9.72/1.96	tff(satz4e, conjecture,
9.72/1.96	  (all_of(^[X0]: in(X0,nat),^[X0]: n_is(ordsucc(X0),n_pl(X0,n_1))))).
9.72/1.96	tff(zf_stmt_0, conjecture,
9.72/1.96	  (![X4]:
9.72/1.96	     (in(X4,d_Sep(omega,^[V_1]: (V_1 != emptyset))) =>
9.72/1.96	      (binunion(X4,d_Sing(X4)) =
9.72/1.96	       ap(plus(X4),binunion(emptyset,d_Sing(emptyset))))))).
9.72/1.96	tff(zf_stmt_1, negated_conjecture,
9.72/1.96	  (~
9.72/1.96	    (![X4]:
9.72/1.96	       (in(X4,d_Sep(omega,^[V_1]: (V_1 != emptyset))) =>
9.72/1.96	        (binunion(X4,d_Sing(X4)) =
9.72/1.96	         ap(plus(X4),binunion(emptyset,d_Sing(emptyset)))))))).
9.72/1.96	tff('16', plain,
9.72/1.96	    ~ (!!((^[Y0 : $i]:
9.72/1.96	             (in(Y0, d_Sep(omega, (^[Y1 : $i]: (Y1 != emptyset)))) =>
9.72/1.96	              (binunion(Y0, d_Sing(Y0)) =
9.72/1.96	               ap(plus(Y0), binunion(emptyset, d_Sing(emptyset)))))))),
9.72/1.96	    inference('cnf', [status(esa)], [zf_stmt_1])).
9.72/1.96	tff('17', plain,
9.72/1.96	    ~ (in('#sk1', d_Sep(omega, (^[Y0 : $i]: (Y0 != emptyset)))) =>
9.72/1.96	       (binunion('#sk1', d_Sing('#sk1')) =
9.72/1.96	        ap(plus('#sk1'), binunion(emptyset, d_Sing(emptyset))))),
9.72/1.96	    inference('lazy_cnf_exists', [status(thm)], ['16'])).
9.72/1.96	tff('18', plain,  in('#sk1', d_Sep(omega, (^[Y0 : $i]: (Y0 != emptyset)))),
9.72/1.96	    inference('lazy_cnf_imply', [status(thm)], ['17'])).
9.72/1.96	tff(satz4a, axiom,
9.72/1.96	  (all_of(^[X0]: in(X0,nat),^[X0]: n_is(n_pl(X0,n_1),ordsucc(X0))))).
9.72/1.96	tff(zf_stmt_2, axiom,
9.72/1.96	  (![X4]:
9.72/1.96	     (in(X4,d_Sep(omega,^[V_1]: (V_1 != emptyset))) =>
9.72/1.96	      (ap(plus(X4),binunion(emptyset,d_Sing(emptyset))) =
9.72/1.96	       binunion(X4,d_Sing(X4)))))).
9.72/1.96	tff('19', plain,
9.72/1.96	     (!!((^[Y0 : $i]:
9.72/1.96	            (in(Y0, d_Sep(omega, (^[Y1 : $i]: (Y1 != emptyset)))) =>
9.72/1.96	             (ap(plus(Y0), binunion(emptyset, d_Sing(emptyset))) =
9.72/1.96	              binunion(Y0, d_Sing(Y0))))))),
9.72/1.96	    inference('cnf', [status(esa)], [zf_stmt_2])).
9.72/1.96	tff('20', plain,
9.72/1.96	    ![X1]:
9.72/1.96	       (in(X1, d_Sep(omega, (^[Y0 : $i]: (Y0 != emptyset)))) =>
9.72/1.96	        (ap(plus(X1), binunion(emptyset, d_Sing(emptyset))) =
9.72/1.96	         binunion(X1, d_Sing(X1)))),
9.72/1.96	    inference('lazy_cnf_forall', [status(thm)], ['19'])).
9.72/1.96	tff('21', plain,
9.72/1.96	     ($true =>
9.72/1.96	      (ap(plus('#sk1'), binunion(emptyset, d_Sing(emptyset))) =
9.72/1.96	       binunion('#sk1', d_Sing('#sk1')))),
9.72/1.96	    inference('sup+', [status(thm)], ['18', '20'])).
9.72/1.96	tff('22', plain,
9.72/1.96	     (ap(plus('#sk1'), binunion(emptyset, d_Sing(emptyset))) =
9.72/1.96	      binunion('#sk1', d_Sing('#sk1'))),
9.72/1.96	    inference('simplify boolean subterms', [status(thm)], ['21'])).
9.72/1.96	tff('23', plain,
9.72/1.96	    ap(plus('#sk1'), binunion(emptyset, d_Sing(emptyset)))
9.72/1.96	     = binunion('#sk1', d_Sing('#sk1')),
9.72/1.96	    inference('simplify nested equalities', [status(thm)], ['22'])).
9.72/1.96	tff('24', plain,
9.72/1.96	    binunion('#sk1', d_Sing('#sk1'))
9.72/1.96	     != ap(plus('#sk1'), binunion(emptyset, d_Sing(emptyset))),
9.72/1.96	    inference('lazy_cnf_imply', [status(thm)], ['17'])).
9.72/1.96	tff('25', plain, $false,
9.72/1.96	    inference('simplify_reflect-', [status(thm)], ['23', '24'])).
9.72/1.96	
9.72/1.96	% SZS output end Refutation
9.72/1.96	
9.72/1.96	
9.72/1.96	% Terminating...
9.72/2.03	% Runner terminated.
9.72/2.05	% Zipperpin 1.5 exiting
9.72/2.05	EOF